modulo operator - significado y definición. Qué es modulo operator
Diclib.com
Diccionario ChatGPT
Ingrese una palabra o frase en cualquier idioma 👆
Idioma:

Traducción y análisis de palabras por inteligencia artificial ChatGPT

En esta página puede obtener un análisis detallado de una palabra o frase, producido utilizando la mejor tecnología de inteligencia artificial hasta la fecha:

  • cómo se usa la palabra
  • frecuencia de uso
  • se utiliza con más frecuencia en el habla oral o escrita
  • opciones de traducción
  • ejemplos de uso (varias frases con traducción)
  • etimología

Qué (quién) es modulo operator - definición

COMPUTATIONAL OPERATION
Modulo (computing); Modular operation; Mod function; Modulo function; Modulus operator; Modulo operator; Modulo Operator; Modulus Operator; Modulo Operation; Modulus Operation; Modulus operation; Mod operator; % operator; Modulo operation; Mod op; Truncated division; Divmod
  • Quotient and remainder using Euclidean division
  • Quotient and remainder using ceiling division
  • Quotient and remainder using floored division
  • Quotient and remainder using rounded division
  • ''a''}}), using truncated division

modulo operator         
<mathematics> (mod) The operator that returns the remainder after integer division of its first argument by its second. Written as "%" in C and some other languages. Where the second argument is a power of two, the result can be calculated much more quickly using bitwise and with the appropriate bit-mask. (1999-07-12)
modulo         
['m?dj?l??]
¦ preposition Mathematics with respect to or using a modulus of a specified number.
Origin
C19: from L., ablative of modulus.
modulo         
/mod'yu-loh/ 1. <mathematics> modular arithmetic. 2. <mathematics> modulo operator. (1999-07-12)

Wikipedia

Modulo

In computing, the modulo operation returns the remainder or signed remainder of a division, after one number is divided by another (called the modulus of the operation).

Given two positive numbers a and n, a modulo n (often abbreviated as a mod n) is the remainder of the Euclidean division of a by n, where a is the dividend and n is the divisor.

For example, the expression "5 mod 2" would evaluate to 1, because 5 divided by 2 has a quotient of 2 and a remainder of 1, while "9 mod 3" would evaluate to 0, because 9 divided by 3 has a quotient of 3 and a remainder of 0; there is nothing to subtract from 9 after multiplying 3 times 3.

Although typically performed with a and n both being integers, many computing systems now allow other types of numeric operands. The range of values for an integer modulo operation of n is 0 to n − 1 inclusive (a mod 1 is always 0; a mod 0 is undefined, possibly resulting in a division by zero error in some programming languages). See Modular arithmetic for an older and related convention applied in number theory.

When exactly one of a or n is negative, the naive definition breaks down, and programming languages differ in how these values are defined.